On Suboptimal Solution of Antagonistic Matrix Games

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the numerical solution of generalized Sylvester matrix equations

‎The global FOM and GMRES algorithms are among the effective‎ ‎methods to solve Sylvester matrix equations‎. ‎In this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two CG-type algorithms for solving generalized Sylvester matrix‎ ‎equations‎. ‎The proposed methods are iterative projection metho...

متن کامل

BI-MATRIX GAMES WITH INTUITIONISTIC FUZZY GOALS

In this paper, we present an application of intuitionistic fuzzyprogramming to a two person bi-matrix game (pair of payoffs matrices) for thesolution with mixed strategies using linear membership and non-membershipfunctions. We also introduce the intuitionistic fuzzy(IF) goal for a choiceof a strategy in a payoff matrix in order to incorporate ambiguity of humanjudgements; a player wants to max...

متن کامل

A New Solution Concept in Fuzzy Matrix Games

In this paper, we deal with a two-person zero-sum games with fuzzy payoffs and fuzzy goals. The aim of the paper is to explain new concepts of solutions for a two-person zero-sum games with fuzzy payoffs and fuzzy goals. We assume that each player has a fuzzy goal for each of the payoffs. A degree of attainment of the fuzzy goal is defined and the max-min strategy with respect to the degree of ...

متن کامل

MINIMAL SOLUTION OF INCONSISTENT FUZZY MATRIX EQUATIONS

Fuzzy liner systems of equations, play a major role in several applications in various area such as engineering, physics and economics. In this paper, we investigate the existence of a minimal solution of inconsistent fuzzy matrix equation. Also some numerical examples are considered.  

متن کامل

Robust Adaptive LCMV Beamformer Based on an Iterative Suboptimal Solution

The main drawback of closed-form solution of linearly constrained minimum variance (CF-LCMV) beamformer is the dilemma of acquiring long observation time for stable covariance matrix estimates and short observation time to track dynamic behavior of targets, leading to poor performance including low signal-noise-ratio (SNR), low jammer-to-noise ratios (JNRs) and small number of snapshots. Additi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ITM Web of Conferences

سال: 2017

ISSN: 2271-2097

DOI: 10.1051/itmconf/20171003001